Max-planck-institut F Ur Informatik Ordered Semantic Hyper-linking K I N F O R M a T I K Im Stadtwald D 66123 Saarbr Ucken Germany Authors' Addresses

We propose a method for combining the clause linking theorem proving method with theorem proving methods based on orderings This may be useful for incorporating term rewriting based approaches into clause linking In this way some of the proposi tional ine ciencies of ordering based approaches may be overcome while at the same time incorporating the advantages of ordering methods into clause linking The com bination also provides a natural way to combine resolution on non ground clauses with the clause linking method which is essentially a ground method We describe the method prove completeness and show that the enumeration part of clause link ing with semantics can be reduced to polynomial time in certain cases We analyze the complexity of the proposed method and also give some plausibility arguments concerning its expected performance